Modified Mann-Halpern Algorithms for Pseudocontractive Mappings
نویسندگان
چکیده
منابع مشابه
Modified Mann-Halpern Algorithms for Pseudocontractive Mappings
and Applied Analysis 3 We know that T is pseudocontractive if and only if T satisfies the condition Tx − Ty 2 ≤ x − y 2 + (I − T)x − (I − T)y 2 (15) for all x, y ∈ C. Since u ∈ Fix(T), we have from (15) that ‖Tx − u‖ 2 ≤ ‖x − u‖ 2 + ‖x − Tx‖ 2 , (16) for all x ∈ C. By using (13) and (16), we obtain Tyn − u 2 ≤ yn − u 2 + yn − Tyn 2 = (1 − γn)xn + γnT...
متن کاملA Modified Halpern-Type Iteration for Bregman Relatively Nonexpansive Mappings
We introduce a new modified Halpern-type iteration for a family of Bregman relatively nonexpansive mappings and establish strong convergence theorems in reflexive Banach spaces. The results extend the corresponding results obtained by many authors. Mathematics Subject Classification: 47H09; 47H10
متن کاملOn modified Noor iterations for strongly pseudocontractive mappings
In this paper, we analyze a three-step iterative scheme for three strongly pseudocontractive mappings in a uniformly smooth Banach space. Our results can be viewed as an extension of three-step and two-step iterative schemes of Glowinski and Le Tallec [3], Noor [1215] and Ishikawa [7], Liu [10] and Xu [20]. 2000 Mathematics Subject Classification: Primary 47H10, 47H17: Secondary 54H25
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2013
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2013/478647